Application of Taylor-Series Integration to Reentry Problems with Wind
نویسندگان
چکیده
منابع مشابه
Taylor series method with numerical derivatives for initial value problems
The Taylor series method is one of the earliest analytic-numeric algorithms for approximate solution of initial value problems for ordinary differential equations. The main idea of the rehabilitation of this algorithms is based on the approximate calculation of higher derivatives using well-known finite-difference technique for the partial differential equations. The approximate solution is giv...
متن کاملFrom Taylor Series to Taylor Models
An overview of the background of Taylor series methods and the utilization of the differential algebraic structure is given, and various associated techniques are reviewed. The conventional Taylor methods are extended to allow for a rigorous treatment of bounds for the remainder of the expansion in a similarly universal way. Utilizing differential algebraic and functional analytic arguments on ...
متن کاملInequality Problems of Equilibrium Problems with Application
This paper aims at establishing the existence of results for a nonstandard equilibrium problems $(EP_{N})$. The solutions of this inequality are discussed in a subset $K$ (either bounded or unbounded) of a Banach spaces $X$. Moreover, we enhance the main results by application of some differential inclusion.
متن کاملIntegrating Goal Programming, Taylor Series, Kuhn-Tucker Conditions, and Penalty Function Approaches to Solve Linear Fractional Bi-level Programming Problems
In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent...
متن کاملA Taylor series expansions approach to queues with train arrivals
We assess the performance of a discrete-time queueing system with train arrivals. Arrivals at the queue stem from a number of active sessions, each generating a packet in a slot with fixed probability q. Since an exact analysis is not feasible for q 6= 1, we rely on Taylor-series expansions around q = 0 of the joint probability generating functions of the number of active sessions and the queue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Guidance, Control, and Dynamics
سال: 2016
ISSN: 0731-5090,1533-3884
DOI: 10.2514/1.g000378